Postoptimality Analysis for Integer Programming Using Binary Decision Diagrams
نویسندگان
چکیده
We show how binary decision diagrams (BDDs) can be used to solve and obtain postoptimality analysis for linear and nonlinear integer programming problems with binary or general integer variables. The constraint set corresponds to a unique reduced BDD that represents all feasible or near-optimal solutions, and in which optimal solutions correspond to certain shortest paths. The BDD can be queried in real time for in-depth postoptimality reasoning. The approach is equally effective for linear and nonlinear problems. There are currently no other methods for obtaining such an analysis, short of repeatedly re-solving the problem. We illustrate the analysis on capital budgeting and network reliability problems.
منابع مشابه
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller BDDs can be used for the same analysis by employing cost bounding techniques in their construction. Binary decision diagrams (BDDs) have seen widespread application in logic circuit design and product configuration. They also ...
متن کاملALTERNATIVE MIXED INTEGER PROGRAMMING FOR FINDING EFFICIENT BCC UNIT
Data Envelopment Analysis (DEA) cannot provide adequate discrimination among efficient decision making units (DMUs). To discriminate these efficient DMUs is an interesting research subject. The purpose of this paper is to develop the mix integer linear model which was proposed by Foroughi (Foroughi A.A. A new mixed integer linear model for selecting the best decision making units in data envelo...
متن کاملEVBDD-based algorithms for integer linear programming, spectral transformation, and function decomposition
Edge Valued Binary Decision Diagrams evbdd s are directed acyclic graphs which can represent and manipulate integer functions as e ectively as Ordered Binary Decision Di agrams obdds do for Boolean functions They have been used in logic veri cation for showing the equivalence between Boolean functions and arithmetic functions In this paper we present evbdd based algorithms for solving integer l...
متن کاملFactored Edge-Valued Binary Decision Diagrams
Factored Edge-Valued Binary Decision Diagrams form an extension to Edge-Valued Binary Decision Diagrams. By associating both an additive and a multiplicative weight with the edges, FEVBDDs can be used to represent a wider range of functions concisely. As a result, the computational complexity for certain operations can be significantly reduced compared to EVBDDs. Additionally, the introduction ...
متن کاملBinary decision diagrams and integer programming
In this work we show how Binary Decision Diagrams can be used as a powerful tool for 0/1 Integer Programming and related polyhedral problems. We develop an output-sensitive algorithm for building a threshold BDD, which represents the feasible 0/1 solutions of a linear constraint, and give a parallel and -operation for threshold BDDs to build the BDD for a 0/1 IP. In addition we construct a 0/1 ...
متن کامل